Перевод: с английского на русский

с русского на английский

generating sequence

Страницы
  • 1
  • 2

См. также в других словарях:

  • Generating function — This article is about generating functions in mathematics. For generating functions in classical mechanics, see Generating function (physics). For signalling molecule, see Epidermal growth factor. In mathematics, a generating function is a formal …   Wikipedia

  • Sequence — For other uses, see Sequence (disambiguation). In mathematics, a sequence is an ordered list of objects (or events). Like a set, it contains members (also called elements or terms), and the number of terms (possibly infinite) is called the length …   Wikipedia

  • Generating trigonometric tables — In mathematics, tables of trigonometric functions are useful in a number of areas. Before the existence of pocket calculators, trigonometric tables were essential for navigation, science and engineering. The calculation of mathematical tables was …   Wikipedia

  • Kolakoski sequence — In mathematics, the Kolakoski sequence is an infinite list that begins with 1,2,2,1,1,2,1,2,2,1,2,2,1,1,2,1,1,2,2,1,2,1,1,2,1,2,2,1,1,... This is an example of a self generating sequence, as indicated here:(1) write 1; read it as the number of 1… …   Wikipedia

  • Probability-generating function — In probability theory, the probability generating function of a discrete random variable is a power series representation (the generating function) of the probability mass function of the random variable. Probability generating functions are… …   Wikipedia

  • Examples of generating functions — The following examples are in the spirit of George Pólya, who advocated learning mathematics by doing and re capitulating as many examples and proofs as possible. The purpose of this article is to present common tricks of the trade in context, so …   Wikipedia

  • Stirling numbers and exponential generating functions — The use of exponential generating functions or EGFs to study the properties of Stirling numbers is a classical exercise in combinatorics and possibly the canonical example of how symbolic combinatorics, the method that encapsulates the… …   Wikipedia

  • Choice sequence — In intuitionistic mathematics, a choice sequence is a constructive formulation of a sequence. Since the Intuitionistic school of mathematics, as formulated by L. E. J. Brouwer, rejects the idea of a completed infinity, in order to use a sequence… …   Wikipedia

  • Padovan sequence — The Padovan sequence is the sequence of integers P ( n ) defined by the initial values :P(0)=P(1)=P(2)=1,and the recurrence relation:P(n)=P(n 2)+P(n 3).The first few values of P ( n ) are:1, 1, 1, 2, 2, 3, 4, 5, 7, 9, 12, 16, 21, 28, 37, 49, 65,… …   Wikipedia

  • Moment-generating function — In probability theory and statistics, the moment generating function of any random variable is an alternative definition of its probability distribution. Thus, it provides the basis of an alternative route to analytical results compared with… …   Wikipedia

  • De Bruijn sequence — A diagram showing the De Bruijn sequence where k=2 and n=2 In combinatorial mathematics, a k ary De Bruijn sequence B(k, n) of order n, named after the Dutch mathematician Nicolaas Govert de Bruijn, is a cyclic sequence of a given alphabet A …   Wikipedia

Поделиться ссылкой на выделенное

Прямая ссылка:
… Нажмите правой клавишей мыши и выберите «Копировать ссылку»